A New Admissible Pivot Method for Linear Programming
نویسندگان
چکیده
We present a new admissible pivot method for linear programming that works with a sequence of improving primal feasible interior points and dual feasible interior points. This method is a practicable variant of the short admissible pivot sequence algorithm, which was suggested by Fukuda and Terlaky. Here, we also show that this method can be modified to terminate in finite pivot steps. Finedly, we show that this method outperforms Terlalcy's criss-cross method by computational experiments.
منابع مشابه
On the existence of a short admissible pivot sequence for feasibility and linear optimization problems
Finding a pivot rule for the simplex method that is strongly polynomial is an open question. In fact, the shortest length of simplex pivots from any feasible basis to some optimal basis is not known to be polynomially bounded. An admissible pivot is a common generalization of simplex and dual simplex pivots, and there are various admissible pivot methods that are nite, including the least-index...
متن کاملOn the existence of a short admissible pivot sequences for feasibility and linear optimization problems
No part of this Journal may be reproduced in any form, by print, photoprint, mi-croolm or any other means without written permission from Faculty of Technical
متن کاملPivot Rules for Linear Programming: A Survey on Recent Theoretical Developments
The purpose of this paper is to discuss the various pivot rules of the simplex method and its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with finiteness properties of simplex type pivot rules. Well known classical results concerning the simplex method are not considered in this survey, but t...
متن کاملNew variants of finite criss-cross pivot algorithms for linear programming
In this paper we generalize the so called rst in last out pivot rule and the most often selected variable pivot rule for the simplex method as proposed in Zhang to the criss cross pivot setting where neither the primal nor the dual feasibility is preserved The nite ness of the new criss cross pivot variants is proven
متن کاملA survey on pivot rules for linear programming
3 : Abstract The purpose of this paper is to survey the various pivot rules of the simplex method or its variants that have been developed in the last two decades, starting from the appearance of the minimal index rule of Bland. We are mainly concerned with the niteness property of simplex type pivot rules. There are some other important topics in linear programming, e.g. complexity theory or i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- APJOR
دوره 21 شماره
صفحات -
تاریخ انتشار 2004